Location:
Search - shortest path
Search list
Description: 本文在脉冲耦合神经网络(PCNN2Pulse Coupled Neural Network) 的基础上,提出了时延脉冲耦合神经网络
(DPCNN2Delay PCNN) ,并将其成功地用于求解最短路径,同时给出了基于DPCNN 的最短路径求解算法. Caulfield 与
Kinser 提出了用PCNN 求解迷宫问题的方法,虽然他们的方法也可用于求解最短路径,但所需神经元的数量巨大,而本
文的方法所需的神经元的数量远小于他们的方法. 同时,本文的方法充分利用了DPCNN 脉冲快速并行传播的特点,可
迅速地求出最短路径,其所需的计算量仅正比于最短路径的长度,与路径图的复杂程度及路径图中的通路总数无关.
计算机仿真结果表明,采用本文的方法,用少量的神经元就可迅速地求出最短路径.- This paper presents DPCNN(Delay Pulse Coupled Neural Network) based on PCNN and uses DPCNN to find the
shortest path successfully.Meanwhile ,the algorithmof finding the shortest path based on DPCNN is described. Caulfield and Kinser in2
troduced the PCNN method to solve the maze problem and although their method also can be used to find the shortest path ,a large
quantity of neurons are needed. However ,the approach proposed in this paper needed very fewer neurons than proposed by Caulfield
and Kinser. In the meantime ,due to the pulse parallel transmission characteristic of DPCNN ,the approach proposed can find the short2
est path quickly. The computational complexity of our approach is only related to the length of the shortest path , and independent to
the path graph complexity and the number of existing paths in the graph. The results of computer simulations show that by using the
approach proposed in this paper ,we can use a small quantity of neurons to find the shortest p
Platform: |
Size: 102400 |
Author: wangxx |
Hits:
Description: 因特网最短路径优先(OSPF)路由算法的实现：根据给定的网络拓扑图求某路由器到其它路由器的最短路径，并生成路由表-Internet Shortest Path First (OSPF) routing algorithm to achieve: given the network topology of a router to other routers find the shortest path, and generate routing tables
Platform: |
Size: 10240 |
Author: 孙彭 |
Hits:
Description: 使用迪杰斯特拉最短路径算法，非常的简单，仅供参考。-Shortest path algorithm
Platform: |
Size: 10240 |
Author: terry |
Hits:
Description: 单源最短路径的求解，摘自百度！
希望对大家有帮助！-Single-source shortest path
Platform: |
Size: 2048 |
Author: fanbo |
Hits:
Description: 本文件里描述了用蚁群算法寻找最短路径的方法，以及相应的搜索路线图形表示-This document describes the use of ant colony algorithm to find the shortest path method, and the corresponding graphical representation of the search line
Platform: |
Size: 91136 |
Author: 加俊 |
Hits:
Description: 介绍了如何在matlab中最短路径的实现问题-Describes how the shortest path in matlab implementation issues
Platform: |
Size: 29696 |
Author: 缺月 |
Hits:
Description: 此代码实现了网络结点之中最短路径的计算，并输出了各个网络结点的路由表
，路由表包括：目的网络，下一跳，代价，详细地址。此代码的原理是Dijstra算法。在代码的注释中有测试用例,用户测试时只需将程序运行后再将测试用例复制到DOS黑框中即可。测试用例中有详细的用例解释。-This code implements the network nodes being the shortest path calculation, and output of each network node routing table, routing table, including: the destination network, the next hop, the cost, full address. The principle of this code is Dijstra algorithm. There are comments in the code test cases, users only need to run test after test cases can be copied to the DOS black borders. Test use cases in detail to explain.
Platform: |
Size: 1024 |
Author: 刘伟强 |
Hits:
Description: 图的最短路径算法的实现，功能为图的最短路径算法-shortest path
Platform: |
Size: 1024 |
Author: 宗畅 |
Hits:
Description: 带权有向图最短路径算法。应该可以直接运行的，很方便。-Weighted directed graph shortest path algorithm. Should be able to run directly, it is convenient.
Platform: |
Size: 1024 |
Author: JASON____WANG |
Hits:
Description: shortest path algorithm code
Platform: |
Size: 4096 |
Author: c |
Hits:
Description: 最短路径问题。两个点A与B之间有多条路，从A到B有多条方案。求A到B的最短路径-The shortest path problem.There are several paths from point A to B.Now we want to know which path is the shortest.Ihis program can help us desolve the Transportation problem
Platform: |
Size: 4096 |
Author: zhangyue |
Hits:
Description: "Two techiniques for finding shortest path" is a IEEE project and i giva a sample code for that project.
Platform: |
Size: 3072 |
Author: Anil Surendar |
Hits:
Description: 采用vb+ae（arcengine），实现最短路径的生成-get the shortest path from a to b
Platform: |
Size: 1024 |
Author: 波波 |
Hits:
Description: GIS编程，求网状图中A点到B点的最短路径。-Shortest Path
Platform: |
Size: 11264 |
Author: 扎拉 |
Hits:
Description: 本科的毕业设计，基于matlab的最短路径规划设计仿真算法，可以来看一看-Undergraduate course graduation design, the shortest path planning based on matlab simulation algorithm design, can take a look
Platform: |
Size: 4096 |
Author: 廖灿 |
Hits:
Description: 交通图最短路径程序，解决各大城市之间的最短交通路线（数据结构图）。-Transport the shortest path program (graph algorithms, data structures), to solve the shortest transport routes between major cities.
Platform: |
Size: 2048 |
Author: 宋永强 |
Hits:
Description: 图与网络是运筹学（Operations Research）中的一个经典和重要的分支，所研究的
问题涉及经济管理、工业工程、交通运输、计算机科学与信息技术、通讯与网络技术等
诸多领域。下面将要讨论的最短路问题、最大流问题、最小费用流问题和匹配问题等都
是图与网络的基本问题。
我们首先通过一些例子来了解网络优化问题。
例1 最短路问题（SPP－shortest path problem）-shortest path problem）
Platform: |
Size: 1024 |
Author: zuichibi |
Hits:
Description: 在实际问题中，边的权值一般以正权的形式出现，但是很多情况下负权也是存在的。这个时候，最短路径不一定存在。我们无法得到像dijkstra算法那样时间复杂度较低的算法，但是，仍然可以用bellman-ford迭代算法去解决问题。
bellman-ford算法是迭代算法，它不像dijkstra算法，按照一定的顺序直接算出每个点的距离值，而是不断地修改每个点的当前最小距离值，直到求出真正的最短距离为止。
-In practical problems, the edge weight is generally in the form of being the right, but many cases the negative right to exist. This time, the shortest path may not exist. We can not get the algorithm dijkstra algorithm time complexity is low, but you can still use the bellman-ford iterative algorithm to solve the problem.
The bellman-ford algorithm is an iterative algorithm, it is not the dijkstra algorithm to directly calculate the distance value of each point in a certain order, but modify each point of the current minimum distance value, until you find the real shortest distance so far .
Platform: |
Size: 14336 |
Author: liuyunyang |
Hits:
Description: 实现最短路径的搜索，现将最短路径的思路告诉大家，希望大家在优化，并用不同语言编制，我正在学delphi,准备用delphi做成库，本例以由拓扑关系的arc/info 文件为数据源。-Realize the shortest path search
Platform: |
Size: 4096 |
Author: 钟洋洋 |
Hits:
Description: 该程序主要完成的是最短路径问题，最短路径 最短路径-Allow phonetic typing
The program completed the shortest path problem, shortest path, shortest path shortest path
Platform: |
Size: 2048 |
Author: huoshan |
Hits:
«
1
2
...
4
5
6
7
8
910
11
12
13
14
...
50
»